By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 22, Issue 3, pp. 849-1258

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs

Zsolt Tuza

pp. 849-853

Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski

Jácint Szabó

pp. 854-860

Cycles Intersecting Edge-Cuts of Prescribed Sizes

Tomáš Kaiser and Riste Škrekovski

pp. 861-874

Chains in the Noncrossing Partition Lattice

Nathan Reading

pp. 875-886

On the First-Fit Chromatic Number of Graphs

József Balogh, Stephen G. Hartke, Qi Liu, and Gexin Yu

pp. 887-900

Nonlinear Matroid Optimization and Experimental Design

Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, and Henry Wynn

pp. 901-919

Spanning Trees with Many Leaves in Graphs With Minimum Degree Three

Paul S. Bonsma

pp. 920-937

Near-Unanimity Functions and Varieties of Reflexive Graphs

Richard C. Brewster, Tomas Feder, Pavol Hell, Jing Huang, and Gary MacGillivray

pp. 938-960

Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question

Bhalchandra D. Thatte

pp. 961-970

Resonance Graphs and a Binary Coding for the 1-Factors of Benzenoid Systems

Heping Zhang, Peter Che Bor Lam, and Wai Chee Shiu

pp. 971-984

Largest Number of Subtrees of Trees with a Given Maximum Degree

Russell Kirk and Hua Wang

pp. 985-995

Real Number Channel Assignments for Lattices

Jerrold R. Griggs and Xiaohua Teresa Jin

pp. 996-1021

Computing Common Intervals of $K$ Permutations, with Applications to Modular Decomposition of Graphs

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, and Mathieu Raffinot

pp. 1022-1039

Structure and Coloring of Graphs with Only Small Odd Cycles

Susan S. Wang

pp. 1040-1072

On the Graph Bisection Cut Polytope

Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, and Alexander Martin

pp. 1073-1098

Labeled Partitions and the $q$-Derangement Numbers

William Y. C. Chen and Deheng Xu

pp. 1099-1104

Euler–Mahonian Statistics on Ordered Set Partitions

Masao Ishikawa, Anisse Kasraoui, and Jiang Zeng

pp. 1105-1137

Long Local Searches for Maximal Bipartite Subgraphs

Hemanshu Kaul and Douglas B. West

pp. 1138-1144

Elementary Incidence Theorems for Complex Numbers and Quaternions

József Solymosi and Konrad J. Swanepoel

pp. 1145-1148

Sequences with Changing Dependencies

Paul Balister, Béla Bollobás, and Stefanie Gerke

pp. 1149-1154

Split Hypergraphs

Ádám Timár

pp. 1155-1163

Detecting a Theta or a Prism

Maria Chudnovsky and Rohan Kapadia

pp. 1164-1186

Axis-Aligned Subdivisions with Low Stabbing Numbers

Csaba D. Tóth

pp. 1187-1204

The Vector Space over $GF(2)$ Generated by the Common Bases of Two Binary Matroids

K. P. Webb

pp. 1205-1214

Determinants and Longest Cycles of Graphs

Vladimir Ejov, Jerzy A. Filar, Walter Murray, and Giang T. Nguyen

pp. 1215-1225

Isometric Embeddings of Subdivided Complete Graphs in the Hypercube

Laurent Beaudou, Sylvain Gravier, and Kahina Meslem

pp. 1226-1238

Optimal Distance Labeling for Interval Graphs and Related Graph Families

Cyril Gavoille and Christophe Paul

pp. 1239-1258